Hitting properties of a random string
نویسندگان
چکیده
We consider Funaki’s model of a random string taking values in R d. It is specified by the following stochastic PDE, ∂u(x) ∂t = ∂2u(x) ∂x2 + Ẇ . where Ẇ = Ẇ (x, t) is two-parameter white noise, also taking values in Rd. We find the dimensions in which the string hits points, and in which it has double points of various types. We also study the question of recurrence and transience. Supported by an NSF travel grant and an NSA grant.
منابع مشابه
Hitting times for random walks on vertex-transitive graphs
For random walks on finite graphs, we record some equalities, inequalities and limit theorems (as the size of graph tends to infinity) which hold for vertex-transitive graphs but not for general regular graphs. The main result is a sharp condition for asymptotic exponentiality of the hitting time to a single vertex. Another result is a lower bound for the coefficient of variation of hitting tim...
متن کاملNon-Backtracking Centrality Based Random Walk on Networks
Random walks are a fundamental tool for analyzing realistic complex networked systems and implementing randomized algorithms to solve diverse problems such as searching and sampling. For many real applications, their actual effect and convenience depend on the properties (e.g. stationary distribution and hitting time) of random walks, with biased random walks often outperforming traditional unb...
متن کاملWeak Quenched Limiting Distributions for Transient One-dimensional Random Walk in a Random Environment
We consider a one-dimensional, transient random walk in a random i.i.d. environment. The asymptotic behaviour of such random walk depends to a large extent on a crucial parameter κ > 0 that determines the fluctuations of the process. When 0 < κ < 2, the averaged distributions of the hitting times of the random walk converge to a κ-stable distribution. However, it was shown recently that in this...
متن کاملAsymptotic hitting time for a simple evolutionary model of protein folding
We consider two versions of a simple evolutionary algorithm (EA) model for protein folding at zero temperature, namely the (1+1)-EA on the LeadingOnes problem. In this schematic model, the structure of the protein, which is encoded as a bit-string of length n, is evolved to its native conformation through a stochastic pathway of sequential contact bindings. We study the asymptotic behavior of t...
متن کاملFirst Hitting times of Simple Random Walks on Graphs with Congestion Points
We derive the explicit formulas of the probability generating functions of the first hitting times of simple random walks on graphs with congestion points using group representations. 1. Introduction. Random walk on a graph is a Markov chain whose state space is the vertex set of the graph and whose transition from a given vertex to an adjacent vertex along an edge is defined according to some ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002